Privacy and the Dimensionality Curse
نویسنده
چکیده
Most privacy-transformation methods such as k-anonymity or randomization use some kind of transformation on the data for privacy-preservation purposes. In many cases, the data can be indirectly identified with the use of a combination of attributes. Such attributes may be available from public records and they may be used to link the sensitive records to the target of interest. Thus, the sensitive attributes of the record may be inferred as well with the use of publicly available attributes. In many cases, the target of interest may be known to the adversary, which results in a large number of combinations of attributes being known to the adversary. This is a reasonable assumption, since privacy attacks will often be mounted by an adversary with some knowledge of the target. As a result, the number of attributes for identification increases, and results in almost unique identification of the target. In this paper, we will examine a number of privacypreservation methods and show that in each case the privacy-preservation approach becomes either ineffective or infeasible.
منابع مشابه
Towards Breaking the Curse of Dimensionality for High-Dimensional Privacy
The curse of dimensionality has remained a challenge for a wide variety of algorithms in data mining, clustering, classification and privacy. Recently, it was shown that an increasing dimensionality makes the data resistant to effective privacy. The theoretical results seem to suggest that the dimensionality curse is a fundamental barrier to privacy preservation. However, in practice, we show t...
متن کاملOn k-Anonymity and the Curse of Dimensionality
In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed for privacy preserving data mining of multidimensional data records. One of the methods for privacy preserving data mining is that of anonymization, in which a record is released only if it is indistinguishable from k ot...
متن کاملModeling and Identification of a Pem Fuel Cell Humidification System
A theoretical model of a humidifier of Proton Exchange Membrane (PEM) fuel cell systems is developed and analyzed first in this paper. The model shows that there exists a strong nonlinearity in the system. Then, the system is identified using a wavelet networks method. To avoid the curse-of-dimensionality problem, a class of wavelet networks proposed by Billings is employed. The experimental da...
متن کاملBinomial Autoregressive Moving Average Models with an Application to U.S. Recessions
Binary Autoregressive Moving Average (BARMA) models provide a modeling technology for binary time series analogous to the classic Gaussian ARMA models used for continuous data. BARMA models mitigate the curse of dimensionality found in long lag Markov models and allow for non-Markovian persistence. The autopersistence function (APF) and autopersistence graph (APG) provide analogs to the autocor...
متن کاملOn Bias, Variance, 0/1 - Loss, and the Curse of Dimensionality
The purpose of this document is to summarize the main points from the paper, “On Bias, Variance, 0/1 Loss, and the Curse of Dimensionality”, written by Jerome H.Friedman(1997).
متن کاملUsing Randomization to Break the Curse of Dimensionality
This paper introduces random versions of successive approximations and multigrid algorithms for computing approximate solutions to a class of finite and infinite horizon Markovian decision problems (MDPs). We prove that these algorithms succeed in breaking the “curse of dimensionality” for a subclass of MDPs known as discrete decision processes (DDPs).
متن کامل